Parallelization of adaptive MC Integrators

نویسنده

  • Richard Kreckel
چکیده

Monte Carlo (MC) methods for numerical integration seem to be embarassingly parallel on first sight. When adaptive schemes are applied in order to enhance convergence however, the seemingly most natural way of replicating the whole job on each processor can potentially ruin the adaptive behaviour. Using the popular VEGAS-Algorithm as an example an economic method of semi-micro parallelization with variable grain-size is presented and contrasted with another straightforward approach of macro-parallelization. A portable implementation of this semi-micro parallelization is used in the xloops-project and is made publicly available. keywords: parallel computing, grain-size, Monte Carlo integration, Tausworthe, GFSR.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adaptive Variational Integrators

It is now well known that symplectic integrators lose many of their desirable properties when variable step sizes are used. The most common approach to combine adaptive step sizes and symplectic integrators involves the Poincaré transformation of the original Hamiltonian. In this article, we provide a framework for the construction of variational integrators using the Poincaré transformation. S...

متن کامل

Parallel High-Order Integrators

In this work we discuss a class of defect correction methods which is easily adapted to create parallel time integrators for multi-core architectures and is ideally suited for developing methods which can be order adaptive in time. The method is based on Integral Deferred Correction (IDC), which was itself motivated by Spectral Deferred Correction by Dutt, Greengard and Rokhlin (BIT-2000). The ...

متن کامل

ESPResSo - an extensible simulation package for research on soft matter systems

We describe a new program package that is designed to perform numerical Molecular Dynamics (MD) and Monte Carlo (MC) simulations for a broad class of soft matter systems in a parallel computing environment. Our main concept in developing ESPResSo was to provide a user friendly and fast simulation tool which serves at the same time as a research platform capable of rapidly incorporating the late...

متن کامل

The Parallelization of Monte-Carlo Planning - Parallelization of MC-Planning

Since their impressive successes in various areas of large-scale parallelization, recent techniques like UCT and other Monte-Carlo planning variants (Kocsis and Szepesvari, 2006a) have been extensively studied (Coquelin and Munos, 2007; Wang and Gelly, 2007). We here propose and compare various forms of parallelization of bandit-based tree-search, in particular for our computer-go algorithm XYZ.

متن کامل

. N A ] 1 8 A ug 2 00 5 GENERALIZED GALERKIN VARIATIONAL INTEGRATORS

Abstract. We introduce generalized Galerkin variational integrators, which are a natural generalization of discrete variational mechanics, whereby the discrete action, as opposed to the discrete Lagrangian, is the fundamental object. This is achieved by approximating the action integral with appropriate choices of a finite-dimensional function space that approximate sections of the configuratio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997